Tabu search exploiting local optimality in binary optimization
نویسندگان
چکیده
منابع مشابه
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization problem consists in finding a subset of objects for which the overall profit is maximized. In this paper, an iterated tabu search algorithm for solving this problem is proposed. Computational results for problem instan...
متن کاملExploiting Tabu Search Memory in Constrained Problems
T paper puts forth a general method to optimize constrained problems effectively when using tabu search. An adaptive penalty approach is used that exploits the short-term memory structure of the tabu list along with the long-term memory of the search results. It is shown to be effective on a variety of combinatorial problems with different degrees and numbers of constraints. The approach requir...
متن کاملStructural Optimization with Tabu Search
A class of search techniques for discrete optimization problems, Heuristic Search Methods, and their suitability for structural optimization are studied. The Tabu Search method is selected for application to structural weight optimization of skeleton structures. The search method is first tested to find the minima of a function in a non-linear non-convex optimization mathematical problem, and a...
متن کاملTabu Search Based Circuit Optimization
In this paper we address the problem of optimizing mixed CMOS/BiCMOS circuits. The problem is formulated as a constrained combinatorial optimization problem and solved using an tabu search algorithm. Only gates on the critical sensitizable paths are considered for optimization. Such a strategy leads to sizable circuit speed improvement with minimum increase in the overall circuit capacitance. C...
متن کاملAdaptive Tabu Tenure Computation in Local Search
Optimization methods based on complete neighborhood exploration such as Tabu Search are impractical against large neighborhood problems. Strategies of candidate list propose a solution to reduce the neighborhood exploration complexity. We propose in this paper a generic Tabu Search algorithm using adaptive candidate list strategy based on two alternate candidate lists. Each candidate list strat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2023
ISSN: ['1872-6860', '0377-2217']
DOI: https://doi.org/10.1016/j.ejor.2023.01.001